“聚龙一号”装置四层圆盘锥磁绝缘传输线的三维粒子模拟研究

介绍了"聚龙一号"中四层圆盘锥磁绝缘传输线(MITL)的基本理论。在CPIPIC平台上,采用非均匀网格和周期性对称边界条件,建立了"聚龙一号"的四层圆盘锥MITL的三维粒子模拟模型。设置相应的参数并用并行算法模拟得到了该器件中各层在绝缘堆上和MITL中间位置的电流和汇流后的电流,并与理论和实验数据进行相互对比验证。模拟结果表明整个器件在达到磁绝缘状态后具有很高的传输效率,并与实验结果相互验证,为以后进一步的研究提供了保证。     

基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.     

高性能计算分析技术在大型钠冷快堆屏蔽设计中的应用

钠冷快堆堆容器是一体化的池式结构，由众多堆内构件组成且结构复杂，堆芯到生物屏蔽外中子输运过程中各向异性明显且深穿透问题严重，大尺度范围下三维S_N方法计算是制约快堆屏蔽设计的瓶颈。通过将三维SN程序与高性能计算技术相结合，采用并行计算方法可解决快堆堆本体内各向异性的三维深穿透屏蔽问题。本文以中国示范快堆（CFR600）堆本体为研究对象，采用JSNT-CFR程序详细计算了堆本体内的中子注量率、光子注量率、剂量率，并将计算结果与已有的二维程序设计结果进行比较。结果表明，将传统屏蔽计算方法与高性能计算相结合，能满足CFR600堆本体屏蔽计算精度要求，获得更为全面的三维展示效果，在计算模型复杂、粒子穿透深度等复杂问题的屏蔽计算上具有较明显的优势，为大型钠冷快堆屏蔽设计提供有力支撑。     

A finite line source simulation model for geothermal systems with series- and parallel-connected boreholes and independent fluid loops

A model for the simulation of geothermal systems with parallel- and series-connected boreholes is presented. Mass and heat balance problems are formulated for each component in the system and are assembled into system-level problems. A third problem is formulated to account for heat transfer in the bore field, using the finite line source solution. This third problem is coupled to the system-level heat balance problem by an analytical solution of the heat transfer inside boreholes with multiple U-tubes. The simulation model allows for any number of independent fluid loops within the bore field or within individual boreholes and allows for combinations of specified inlet fluid temperatures and heat extraction rates in independent fluid loops. The model accounts for the axial variation of the fluid and borehole wall temperatures and heat extraction rates. The capabilities of the model are demonstrated through three example simulations.     

Parallel Multipopulation Differential Evolutionary Particle Swarm Optimization for Voltage and Reactive Power Control

This paper presents parallel multipopulation differential evolutionary particle swarm optimization (DEEPSO) for voltage and reactive power control (VQC). The problem can be formulated as a mixed integer nonlinear optimization problem and various evolutionary computation techniques have been applied to the problem including PSO, differential evolution (DE), and DEEPSO. Since VQC is one of the online controls, speed‐up of computation is required. Moreover, there is still room for improvement in solution quality. This paper applies parallel multipopulation DEEPSO in order to speed up the calculation and improve solution quality. The proposed method is applied to IEEE 30, 57, and 118 bus systems. The results indicate that the proposed method can realize fast computation and minimize more active power losses than the conventional evolutionary computation techniques.     

基于并行多通道卷积长短时记忆网络的轴承寿命预测方法

在预测轴承剩余使用寿命时，数据间的时序特性是一个可以利用的重要隐藏信息。为了更好地提取具有时序信息的特征用于预测，提出了一种基于并行多通道卷积长短时记忆网络（PMCCNN-LSTM）的剩余使用寿命预测模型。该模型主要由两部分组成：前端为并行多通道卷积网络（PMCCNN），提取信号特征，挖掘数据的时序特性，并采用逐层训练和微调的方式提升参数的收敛性；后端为长短时记忆（LSTM）网络，基于特征进行剩余使用寿命预测，并采用加权平均的方法对预测结果进行平滑处理。在一个轴承加速寿命实验的公开数据集上使用留一法验证了该模型的准确性，实验结果表明：所提模型的平均误差与最大误差分别比传统的卷积神经网络（CNN）低23.38%和15.84%，比传统的LSTM低24.14%和19.01%，比卷积长短时记忆网络（CNN-LSTM）低30.32%和23.09%。     

鑫达黄金矿业急倾斜薄矿体中深孔采矿方法的研究与优化

近年来，随着开采技术的发展，急倾斜薄矿脉采用中深孔采矿越来越多。为了降低生产成本，提高经济效益和安全系数。通过在矿房对扇形中深孔和平行中深孔进行现场试验，得到扇形中深孔比平行中深孔工程量少、千吨采切比小的结论。将扇形中深孔采矿方法在急倾斜薄矿脉中进行推广应用，取得了一定经济效益。     

Design and analysis of a class of redundant collaborative manipulators with 2D large rotational angles

The parallel spindle heads with high rotational capability are demanded in the area of multi-axis machine tools and 3D printers. This paper focuses on designing a class of 2R1T (R: Rotation; T: Translation) parallel spindle heads and the corresponding collaborative 5-axis manipulators with 2-dimension (2D) large rotational angles. In order to construct 2D rotational degrees of freedom (DOFs), a platform with 2D revolute joints is proposed first. Based on the constraint screw theory, the feasible limbs that can be connected in the platform are synthesized. In order to provide constant rotational axis for the platform, a class of redundant limbs are designed. A class of redundant 2R1T parallel spindle heads is obtained by connecting the redundant limbs with the platform and the redundant characteristics are verified by the modified Grübler-Kutzbach criterion. The corresponding 5-axis collaborative manipulators are presented by constructing a 2-DOF series translational bottom moving platform. The inverse kinematics and the orientation workspace as well as the decoupling characteristics of this type of 2R1T parallel spindle heads are analyzed. The results show that these manipulators have large 2D rotational angles than the traditional A3/Z3 heads and can be potentially used in the application of multi-axis machine tools and the 3D printers.     

分段中深孔采矿法切割槽及底部出矿结构设计优化

间柱采场用分段中深孔嗣后充填采矿法回采，为利用中深孔爆破形成切割槽及底部桃形体出矿结构，优化切割天井位置，以溜矿口上方的桃形体作为安全隔柱，利用溜矿口空间作为底部拉槽的凿岩和装药空间；采用平行中深孔和扇形中深孔相结合的方式进行布眼，爆破形成切割槽和底部桃形体出矿结构，避免了采用人工浅孔爆破施工的安全风险,切割槽爆破到位，底部桃形体出矿结构成型良好且稳固安全，该技术已在全矿推广应用。     

The provably good parallel seeding algorithms for the k-means problem with penalties

As a classic NP-hard problem in machine learning and computational geometry, the k-means problem aims to partition the given points into k sets to minimize the within-cluster sum of squares. The k-means problem with penalties (k-MPWP), as a generalizing problem of the k-means problem, allows a point that can be either clustered or penalized with some positive cost. In this paper, we mainly apply the parallel seeding algorithm to the k-MPWP, and show sufficient analysis to bound the expected solution quality in the case where both the number of iterations and the number of points sampled in each iteration can be given arbitrarily. The approximate guarantee can be obtained as , where is a polynomial function involving the maximal ratio M between the penalties. On one hand, this result can be viewed as a further improvement on the parallel algorithm for k-MPWP given by Li et al., where the number of iterations depends on other factors. On the other hand, our result also generalizes the one solving the k-means problem presented by Bachem et al., because k-MPWP is a variant of the k-means problem. Moreover, we present a numerical experiment to show the effectiveness of the parallel algorithm for k-means with penalties.